Graphs, Quadratic Forms, and Quantum Codes

نویسندگان

  • Markus Grassl
  • Andreas Klappenecker
  • Martin Rötteler
چکیده

We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new connection between quantum codes and quadratic forms. We provide some simple examples to illustrate our results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Self-Dual Quantum Codes, Graphs, and Boolean Functions

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...

متن کامل

Design of Quantum Stabilizer Codes From Quadratic Residues Sets

We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form p = 4n ± 1. The proposed Type-I stabilizer codes are of cyclic structure and code length N = p. They are constructed based on multi-weight circulant matrix generated from idempotent polynomial, which is obtained from a quadratic residue set. The proposed Type...

متن کامل

A Note on the Minimum Distance of Quantum LDPC Codes

We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi [13]. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse and Zémor [3]. This result is obtained by examining a family of subsets of the hypercube which locally satisfy some parity conditions.

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform

We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/quant-ph/0703112  شماره 

صفحات  -

تاریخ انتشار 2000